Perspicuity and Granularity in Refinement
نویسنده
چکیده
This paper discusses how different ways of introducing “extra” actions in refinement (such as weak refinement, action refinement, stuttering steps) relate to the underlying refinement relations used (e.g. trace refinement, failures refinement). In particular, we aim to show how the choices in those two dimensions are interdependent. The paper is not intended to be polemic (“my formalism/refinement relation is better than yours”) nor is it really meant to be a first introduction to the topic. Where it appears to state the obvious, this is in an attempt to ensure that commonalities, differences, and design decisions in refinement relations are exhibited in an unambiguous and uncontroversial way.
منابع مشابه
Sometimes "Tomorrow" is "Sometime" - Action Refinement in a Temporal Logic of Objects
We address the hierarchical (vertical) decomposition, or abstract implementation, of object specification in temporal logic. Whereas previous approaches to refinement in the context of temporal logic such as those developed by Lamport and by Barringer, Kuiper and Pnueli are based on a single logic that accommodates different levels of action granularity, our approach is based on relating differ...
متن کاملQuery Efficiency of Polygon Objects Based On the Tile Granularity of Quad-Tree
Quad-tree index has been widely used in geo-spatial database management and GIS. Yet, how to determine a suitable index depth of quad-tree for an optimal query in terms of query speed remains a difficult task. Bearing this task in mind, the authors analyze the close correlation between the index depth and the index range. The query efficiency of quad-tree is introduced as a quantitative measure...
متن کاملEffective Keyword Search in XML Documents Based on MIU
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data. This paper focuses on effective keyword search in XML documents which are modeled as labeled trees. We first analyze the problems caused by the refinement of result granularity during XML keyword search and then prop...
متن کاملHIRAD: A Hierarchical Higher Order Radiosity Implementation
In this paper we describe our hierarchical higher order radiosity implementation, called HIRAD. We present a number of improvements to the original wavelet radiosity method: We propose new basis functions for (convex) quadrilaterals and for triangles offering finer granularity than the usual product-1D bases, a new refinement criterion for hierarchical refinement and a very general strategy for...
متن کاملFine-Grain Abstraction and Sequential Don’t Cares for Large Scale Model Checking
Abstraction refinement is a key technique for applying model checking to the verification of real-world digital systems. In previous work, the abstraction granularity is often limited at the state variable level, which is too coarse for verifying industrial-scale designs. In this paper, we propose a finer grain abstraction in which intermediate variables are selectively inserted to partition la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011